Grothendieck Classes and Chern Classes of Hyperplane Arrangements
نویسندگان
چکیده
منابع مشابه
Grothendieck Classes and Chern Classes of Hyperplane Arrangements
We show that the characteristic polynomial of a hyperplane arrangement can be recovered from the class in the Grothendieck group of varieties of the complement of the arrangement. This gives a quick proof of a theorem of Orlik and Solomon relating the characteristic polynomial with the ranks of the cohomology of the complement of the arrangement. We also show that the characteristic polynomial ...
متن کاملChern Classes of Free Hypersurface Arrangements
The Chern class of the sheaf of logarithmic derivations along a simple normal crossing divisor equals the Chern-Schwartz-MacPherson class of the complement of the divisor. We extend this equality to more general divisors, which are locally analytically isomorphic to free hyperplane arrangements.
متن کاملComplexes, duality and Chern classes of logarithmic forms along hyperplane arrangements
We describe dualities and complexes of logarithmic forms and differentials for central affine and corresponding projective arrangements. We generalize the Borel–Serre formula from vector bundles to sheaves on P with locally free resolutions of length one. Combining these results we present a generalization of a formula due to Mustaţă and Schenck, relating the Poincaré polynomial of an arrangeme...
متن کاملGrothendieck Classes of Quiver Varieties
We prove a formula for the structure sheaf of a quiver variety in the Grothendieck ring of its embedding variety. This formula generalizes and gives new expressions for Grothendieck polynomials. Our formula is stated in terms of coefficients that are uniquely determined by the geometry and can be computed by an explicit combinatorial algorithm. We conjecture that these coefficients have signs t...
متن کاملFf Ur Mathematik in Den Naturwissenschaften Leipzig Hyperplane Arrangements Separating Arbitrary Vertex Classes in N-cubes Hyperplane Arrangements Separating Arbitrary Vertex Classes in N-cubes
Strictly layered feedforward networks with binary neurons are viewed as maps from the vertex set of an n cube to the vertex set of an l cube With only one output neuron in principle they can realize any Boolean function on n inputs We address the problem of determining the necessary and su cient numbers of hidden units for this task by using separability properties of a ne oriented hyperplane a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2012
ISSN: 1687-0247,1073-7928
DOI: 10.1093/imrn/rns100